CONSISTENCY OF DISTRIBUTED SYSTEM WITH ACTIVE INITIATOR PROCESS WITHOUT USELESS CHECKPOINTS
نویسندگان
چکیده
منابع مشابه
Preventing Useless Checkpoints in Distributed Computations
A useless checkpoint is a local checkpoint that cannot be part of a consistent global checkpoint. This paper addresses the following important problem. Given a set of processes that take (basic) local checkpoints in an independent and unknown way, the problem is to design a communication-induced checkpointing protocol that directs processes to take additional local (forced) checkpoints to ensur...
متن کاملA VP-Accordant Checkpointing Protocol Preventing Useless Checkpoints
A useless checkpoint corresponds to the occurrence of a checkpoint and communication pattern called Z-cycle. A recent result shows that ensuring a computation without Z-cycles is a particular application of a property, namely Virtual Precedence (VP), defined on an interval-based abstraction of a computation. In this paper we first propose a taxonomy of communication-induced checkpointing protoc...
متن کاملDistributed Consistency-Based Diagnosis without Behavior
This paper faces the task of distributed diagnosis without exploiting any component behavioral model. A diagnosis problem is specified by an observation that just states whether each system output is either correct or incorrect. The system is split into parts, and a distinct diagnoser, which is supplied with knowledge that has been compiled off-line and is capable of communicating with its neig...
متن کاملTransaction-Consistent Global Checkpoints in a Distributed Database System
Checkpointing and rollback recovery are well-known techniques for handling failures in distributed database systems. In this paper, we establish the necessary and sufficient conditions for the checkpoints on a set of data items to be part of a transaction-consistent global checkpoint of the distributed database. This can throw light on designing efficient, non-intrusive checkpointing techniques...
متن کاملTight Upper Bound on Useful Distributed System Checkpoints
In this paper, we give an alternative proof of the necessary and sufficient condition for achieving optimal checkpoint garbage collection in distributed systems [9]. We show that, by formulating the recovery line calculation problem as a reachability analysis problem on a rollback-dependency graph, the proof can be greatly simplified. We also present a polynomial-time optimal garbage collection...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computing
سال: 2014
ISSN: 2312-5381,1727-6209
DOI: 10.47839/ijc.5.1.387